Dispatcher3 D1.1 - Technical resources and problem definition

This deliverable starts with the proposal of Dispatcher3 and incorporates the development produced during the first five months of the project: activities on different workpackages, interaction with Topic Manager and Project Officer, and input received during the first Advisory Board meeting and follow up consultations. This deliverable presents the definition of Dispatcher3 concept and methodology. It includes the high level the requirements of the prototype, preliminary data requirements, preliminary technical infrastructure requirements, preliminary data processing and analytic techniques identification and a preliminary definition of scenarios. The deliverable aims at defining the view of the consortium on the project at these early stages, incorporating the feedback obtained from the Advisory Board and highlighting the further activities required to define some of the aspects of the project

Frequency of symbol occurrences in simple non-primitive stochastic models

We study the random variable Y-n representing the number of occurrences of a given symbol in a word of length n generated at random. The stochastic model we assume is a simple non-ergodic model defined by the product of two primitive rational formal series, which form two distinct ergodic components. We obtain asymptotic evaluations for the mean and the variance of Y-n and its limit distribution. It turns out that there are two main cases: if one component is dominant and non-degenerate we get a Gaussian limit distribution; if the two components are equipotent and have different leading terms of the mean, we get a uniform limit distribution. Other particular limit distributions are obtained in the case of a degenerate dominant component and in the equipotent case when the leading terms of the expectation values are equal

Frequency of symbol occurrences in bicomponent stochastic models

We give asymptotic estimates of the frequency of occurrences of a symbol in a random word Generated by any bicomponent stochastic model. More precisely, we consider the random variable Y-n representing the number of occurrences of a given symbol in a word of length n generated at random; the stochastic model is defined by a rational formal series r having a linear representation with two primitive components. This model includes the case when r is the product or the sum of two primitive rational formal series. We obtain asymptotic evaluations for the mean value and the variance of Yn and its limit distribution

Speed and entropy of an interacting continuous time quantum walk

We present some dynamic and entropic considerations about the evolution of a continuous time quantum walk implementing the clock of an autonomous machine. On a simple model, we study in quite explicit terms the Lindblad evolution of the clocked subsystem, relating the evolution of its entropy to the spreading of the wave packet of the clock. We explore possible ways of reducing the generation of entropy in the clocked subsystem, as it amounts to a deficit in the probability of finding the target state of the computation. We are thus lead to examine the benefits of abandoning some classical prejudice about how a clocking mechanism should operate.Comment: 25 pages, 14 figure

A semantic measure of the execution time in linear logic

AbstractWe give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: (1) a net is head-normalizable (i.e. normalizable at depth 0) if and only if its interpretation in the multiset based relational semantics is not empty and (2) a net is normalizable if and only if its exhaustive interpretation (a suitable restriction of its interpretation) is not empty. We then give a semantic measure of execution time: we prove that we can compute the number of cut elimination steps leading to a cut free normal form of the net obtained by connecting two cut free nets by means of a cut-link, from the interpretations of the two cut free nets. These results are inspired by similar ones obtained by the first author for the untyped lambda-calculus

A software engine for multi-criteria decision support in flight management - Use of dynamic cost functions - Architecture and first results

Tactical trajectory optimisation should consider the total expected cost of the flight (fuel and delay). The cost of fuel can be estimated from the expected fuel usage. The cost of delay can be approximated by simple non-linear functions but, we propose a methodology to explicitly consider its different components: passenger related (regulation 261, duty of care, missed connections and soft costs), crew and maintenance, and reactionary costs (delay and curfew). This explicit modelling captures the non-continuous aspects of the cost function, which can significantly impact the optimisation profile, e.g. ensure that missed connections are reduced. The cost of delay, dependent on the arrival time at the gate, can be subject to uncertainties which are inherent (e.g. if a passenger will or not miss a connection) and external (e.g. taxi-in or holding times). Therefore, the optimisation framework should estimate the arrival time to the gate (not the runway) while considering these associated uncertainties. The described architecture models the processes affecting the cost (e.g. considering probabilities of missed connections or explicit propagation of delay) and operational aspects at arrival which impact the realisation of the planned optimised trajectory (holding time, sequencing and merging distance (tromboning), and taxi-in time). The consideration of the operational uncertainties enables the estimation of the probability of achieving the flight on-time performance. All these operational uncertainties are integrated into the cost function producing a total expected cost as a function of arrival to FL100 during the descent at the arrival airport. The trajectory is then optimised in its vertical and speed profile finding the cost index which is expected to minimise the total costs with a simulated annealing framework. The first results presented describe how the cost functions are generated, uncertainties considered and trajectories optimised for a flight in the LEDM-EDDF route

Dynamical kickback and noncommuting impurities in a spin chain

In an interacting continuous time quantum walk, while the walker (the cursor) ismoving on a graph, computational primitives (unitary operators associated to the edges) are applied to ancillary qubits (the register). The model with one walker was originally proposed by R. Feynman, who thus anticipated many features of the Continuous Time Quantum Walk (CTWQ) computing paradigm. In this note we examine the behaviour of an interacting CTQW with two walkers and examine the interaction of the walkers with noncommuting primitives. We endow such a walk with a notion of trajectory, in the sense of sample path of an associated Markov process, in order to use such notions as sojourn time and first passage time as heuristic tools for gaining intuition about its behaviour

Quantum walks : a Markovian perspective

For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus, propagates at a rate which is linear in time, as compared to the square root rate for a classical random walk. Indeed, it has been suggested that there are graphs that can be traversed by a quantum walker exponentially faster than by the classical random analogue. In this note we adopt the approach of exploring the conditions to impose on a Markov process in order to emulate its quantum counterpart: the central issue that emerges is the problem of taking into account, in the numerical generation of each sample path, the causative effect of the ensemble of trajectories to which it belongs. How to deal numerically with this problem is shown in a paradigmatic example

Editorial: Molecular Mechanisms of Pathogen-Driven Infectious and Neoplastic Diseases

No abstract availabl